On the nonexistence of almost Moore digraphs

Title: On the nonexistence of almost Moore digraphs
Creator: Conde, J.; Gimbert, J.; González, J.; Miller, M.; Miret, J. M.
Relation: European Journal of Combinatorics Vol. 39, p. 170-177
Publisher Link: http://dx.doi.org/10.1016/j.ejc.2013.12.003
Publisher: Academic Press
Resource Type: journal article
Date: 2014
Description: Digraphs of maximum out-degree at most d>1, diameter at most k>1 and order N(d,k)=d+⋯+d^k are called almost Moore or(d,k)-digraphs. So far, the problem of their existence has been solved only when d=2,3 or k=2,3,4. In this paper we derive the nonexistence of (d,k)-digraphs, with k>4 and d>3, under the assumption of a conjecture related to the factorization of the polynomials Φ_n(1+x+⋯+x^k), where Φn(x) denotes the nnth cyclotomic polynomial and 1
Subject: Moore digraphs; polynomials; mathematics
Identifier: http://hdl.handle.net/1959.13/1305206
Identifier: uon:20998
Identifier: ISSN:0195-6698
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format